79 research outputs found
Strong stability of 3-wise -intersecting families
Let be a family of subsets of an -element set. The family
is called -wise -intersecting if the intersection of any
three subsets in is of size at least . For a real number
we define the measure of the family by the sum of
over all . For example, if
consists of all subsets containing a fixed -element set, then it is a
-wise -intersecting family with the measure .
For a given , by choosing sufficiently large, the following
holds for all with . If is a
-wise -intersecting family with the measure at least
, then satisfies one of (i) and (ii): (i)
every subset in contains a fixed -element set, (ii) every
subset in contains at least elements from a fixed
-element set
Non-trivial 3-wise intersecting uniform families
A family of -element subsets of an -element set is called 3-wise
intersecting if any three members in the family have non-empty intersection. We
determine the maximum size of such families exactly or asymptotically. One of
our results shows that for every there exists such that if
and then the maximum size
is .Comment: 12 page
Binding numbers and f-factors of graphs
AbstractLet G be a connected graph of order n, a and b be integers such that 1 β€ a β€ b and 2 β€ b, and f: V(G) β {a, a + 1, β¦, b} be a function such that Ξ£(f(x); x β V(G)) β‘ 0 (mod 2). We prove the following two results: (i) If the binding number of G is greater than (a + b β1)(nβ1)(anβ(a + b) + 3) and n β₯(a + b)2a, then G has an f-factor; (ii) If the minimum degree of G is greater than (bn β 2)(a + b), and n β₯(a + b)2a, then G has an f-factor
- β¦